Min fars chef havde en fed stilling som min fars far
نویسندگان
چکیده
منابع مشابه
A Hybrid Min-min Max-min Algorithm with Improved Performance
The high cost of supercomputers and the need for large-scale computational resources has led to the development of network of computational resources known as Grid. To better use tremendous capabilities of this large scale distributed system, effective and efficient scheduling algorithms are needed. Many such algorithms have been designed and implemented. We introduce a new scheduling algorithm...
متن کاملSelf-Burns in Fars Province, Southern Iran
BACKGROUND The alarming incidence of self- burning provoked to set up a multidisciplinary preventive program to decrease the incidence and complications of this harmful issue. This study investigated the incidence and the preventive measures in self-burn in Fars Province, southern Iran. METHODS This study was a longitudinal prospective design on trend of self-inflicted burn injuries in Fars p...
متن کاملMin-up/min-down polytopes
In power generation and other production settings, technological constraints force restrictions on the number of time-periods that a machine must stay up once activated, and stay down once deactivated. We characterize the polyhedral structure of a model representing these restrictions. We also describe a cutting-plane method for solving integer programs involving such min-up and min-down times ...
متن کاملStudy of Temperature Changes in Fars Province
Climate change is a phenomenon has been based on the available evidence from a very long time ago and now its existence is very probable. The speed and nature of climate parameters changes at the middle of twentieth century has been different and its quickness more than the before and its trend changed to some extent comparing to the past. Climate change issue now regarded as not only one of th...
متن کاملLogical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem
Let $G$ be a weighted digraph, $s$ and $t$ be two vertices of $G$, and $t$ is reachable from $s$. The logical $s$-$t$ min-cut (LSTMC) problem states how $t$ can be made unreachable from $s$ by removal of some edges of $G$ where (a) the sum of weights of the removed edges is minimum and (b) all outgoing edges of any vertex of $G$ cannot be removed together. If we ignore the second constraint, ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Slagmark - Tidsskrift for idéhistorie
سال: 1970
ISSN: 1904-8602,0108-8084
DOI: 10.7146/sl.v0i44.105108